Underspecified Modelling of Complex Discourse Constraints
نویسندگان
چکیده
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as soft constraints. We show how to use Regular Tree Gramamrs to process such constraints, and how the representation of some constraints depends on the expressive power of this formalism.
منابع مشابه
Semantic Underspecification : Which Technique for What Purpose ?
In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...
متن کاملSemantic Underspecification : Which Technique for What
In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...
متن کاملA compositional approach to short answers in dialogue
Non-sentential utterances, and especially short answers, are pervasive in dialogues. Some researchers have observed that there are complex syntactic, semantic and pragmatic constraints on acceptable short answers. This has been used to motivate a radically unmodular architecture for their analysis, where information from grammar and from discourse isn’t distinguished. Here we suggest an alterna...
متن کاملEfficient Processing of Underspecified Discourse Representations
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominance graphs and weighted tree grammars, we provide the first possibility for computing an underspecified discourse description and a best discourse representation efficiently enough to process even the longest discourses...
متن کاملExploring a type-theoretic approach to accessibility constraint modelling
Accessibility constraints When dealing with anaphora resolution, anaphoric expressions are often considered to have access to a restricted set of discourse referents. The choice of the relevant discourse referent inside this set may depends on various kinds of information (morphosyntactic features, semantic features, salience. . . ). But theories that give a dynamic interpretation of language a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008